Quasiconvex Programming
نویسنده
چکیده
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied applications of this geometric optimization technique in meshing, scientific computation, information visualization, automated algorithm analysis, and robust statistics.
منابع مشابه
Quasiconvex Duality Theorems with Quasiconjugates and Generator
This paper is based on the author’s thesis, “On duality theorems for quasiconvex programming”. In this paper, we investigate duality theorems for quasiconvex programming as generalizations of results in convex programming, and consists of three topics. The first topic is about quasiconjugates and polar sets. The second is about three types of set containment characterizations. The third is abou...
متن کاملSome constraint qualifications for quasiconvex vector-valued systems
In this paper, we consider minimization problems with a quasiconvex vector-valued inequality constraint. We propose two constraint qualifications, the closed cone constraint qualification for vector-valued quasiconvex programming (the VQ-CCCQ) and the basic constraint qualification for vector-valued quasiconvex programming (the VQ-BCQ). Based on previous results by Benoist, Borwein, and Popovic...
متن کاملA Surrogate Dual Algorithm for Quasiconvex Quadratic Problems Abdessamad Amir and Adnan Yassine
The purpose of this paper is to solve, via a surrogate dual method, a quadratic program where the objectif function is not explicitly given. We apply our study to quasiconvex quadratic programs.
متن کاملCharacterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
In convex programming, characterizations of the solution set in terms of the subdifferential have been investigated by Mangasarian. An invariance property of the subdifferential of the objective function is studied, and as a consequence, characterizations of the solution set by any solution point and any point in the relative interior of the solution set are given. In quasiconvex programming, h...
متن کاملOptimality Conditions for Quasiconvex Programs
We present necessary and sufficient optimality conditions for a problem with a convex set constraint and a quasiconvex objective function. We apply the obtained results to a mathematical programming problem involving quasiconvex functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0412046 شماره
صفحات -
تاریخ انتشار 2004